فیلترها/جستجو در نتایج    

فیلترها

سال

بانک‌ها




گروه تخصصی











متن کامل


نویسندگان: 

HAMZEH ASMA

اطلاعات دوره: 
  • سال: 

    2020
  • دوره: 

    5
  • شماره: 

    1
  • صفحات: 

    13-22
تعامل: 
  • استنادات: 

    0
  • بازدید: 

    150
  • دانلود: 

    0
چکیده: 

In this paper, exact formulas for the dependence, independence, vertex cover and clique polynomials of the POWER GRAPH and its superGRAPHs for certain finite groups are presented.

شاخص‌های تعامل:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

بازدید 150

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesدانلود 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesاستناد 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesمرجع 0
اطلاعات دوره: 
  • سال: 

    1389
  • دوره: 

    7
  • شماره: 

    3 (پیاپی 26)
  • صفحات: 

    71-76
تعامل: 
  • استنادات: 

    0
  • بازدید: 

    1466
  • دانلود: 

    409
چکیده: 

در این مقاله مربع گراف های جهت دار مورد بحث قرار می گیرد. H2 مربع گراف H است که به وسیله اضافه کردن یال هایی درH  که دو راس مجزا را که فاصله بین آن ها دقیقا 2 باشد را به هم وصل می کند، به دست می آید. (در صورتی که یک گراف غیر جهت دار باشد.) در این مقاله به بررسی توان دوم گراف های جهت دار برای اولین بار پرداخته شده و قضایای مرتبط با این موضوع و مثال هایی جهت تشریح مطلب بیان می شود.

شاخص‌های تعامل:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

بازدید 1466

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesدانلود 409 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesاستناد 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesمرجع 0
نویسندگان: 

Soleimani Masoumeh | Naderi Mohamad Hasan

اطلاعات دوره: 
  • سال: 

    2023
  • دوره: 

    8
  • شماره: 

    2
  • صفحات: 

    161-173
تعامل: 
  • استنادات: 

    0
  • بازدید: 

    33
  • دانلود: 

    0
چکیده: 

‎Consider a ring $R$ with order $p$ or $p^2$‎, ‎and let $\mathcal{P}(R)$ represent its multiplicative POWER GRAPH‎. ‎For two distinct rings $R_1$ and $R_2$ that possess identity element 1‎, ‎we define a new structure called the unit semi-cartesian product of their multiplicative POWER GRAPHs‎. ‎This combined structure‎, ‎denoted as $G.H$‎, ‎is constructed by taking the Cartesian product of the vertex sets $V(G) \times V(H)$‎, ‎where $G = \mathcal{P}(R1)$ and $H = \mathcal{P}(R2)$‎. ‎The edges in $G.H$ are formed based on specific conditions‎: ‎for vertices $(g,h)$ and $(g^\prime,h^\prime)$‎, ‎an edge exists between them if $g = g^\prime$‎, ‎$g$ is a vertex in $G$‎, ‎and the product $hh^\prime$ forms a vertex in $H$‎.   ‎Our exploration focuses on understanding the characteristics of the multiplicative POWER GRAPH resulting from the unit semi-cartesian product $\mathcal{P}(R1).\mathcal{P}(R2)$‎, ‎where $R_1$ and $R_2$ represent distinct rings‎. ‎Additionally‎, ‎we offer insights into the properties of the multiplicative POWER GRAPHs inherent in rings of order $p$ or $p^2$‎.

شاخص‌های تعامل:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

بازدید 33

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesدانلود 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesاستناد 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesمرجع 0
مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources
اطلاعات دوره: 
  • سال: 

    2013
  • دوره: 

    44
تعامل: 
  • بازدید: 

    139
  • دانلود: 

    0
چکیده: 

THE AIM OF THIS PAPER IS TO IDENTIFY COMPLETE POWER GRAPHS OF GROUPS AND COMPUTE THEIR CLIQUE NUMBER AND SHOW THAT POWER GRAPHS ARE PERFECT. MOREOVER, AUTOMORPHISM OF THE POWER GRAPH OF CYCLIC GROUPS IS DETERMINED HERE.

شاخص‌های تعامل:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

بازدید 139

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesدانلود 0
همایش: 

IRANIAN ALGEBRA SEMINAR

اطلاعات دوره: 
  • سال: 

    2016
  • دوره: 

    25
تعامل: 
  • بازدید: 

    220
  • دانلود: 

    0
چکیده: 

THE UNDIRECTED POWER GRAPH G(R) OF A RING R IS AN UNDIRECTED GRAPH WHOSE VERTEX SET IS R AND TWO VERTICESA, B Î R ARE ADJACENT IF AND ONLY IF A ¹ B AND AM = B OR BN = A FOR SOME POSITIVE INTEGERS M, N. IN THIS PAPER, WE SHOW THAT IF P IS A PRIME NUMBER, THEN THE POWER GRAPH OF THE DIRECT PRODUCT OF COMMUTATIVE RINGS OF ORDER PN IS THE CARTESIAN PRODUCT OF POWER GRAPHS OF RINGS.

شاخص‌های تعامل:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

بازدید 220

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesدانلود 0
اطلاعات دوره: 
  • سال: 

    1402
  • دوره: 

    53
  • شماره: 

    1
  • صفحات: 

    69-79
تعامل: 
  • استنادات: 

    0
  • بازدید: 

    203
  • دانلود: 

    43
کلیدواژه: 
چکیده: 

In this paper, a novel risk-based, two-objective (technical and economical) optimal reactive POWER dispatch method in a wind-integrated POWER system is proposed which is more consistent with operational criteria.  The technical objective includes the minimization of the new voltage instability risk index. The economical objective includes cost minimization of reactive POWER generation and active POWER loss. The proposed voltage instability risk employs a hybrid possibilistic (Delphi-Fuzzy)-probabilistic approach that takes into consideration the operator’s experience, the wind speed and demand forecast uncertainties when quantifying the risk index. The decision variables are the reactive POWER resources of the system. To solve the problem, the modified multi-objective particle swarm optimization algorithm with sine and cosine acceleration coefficients is utilized. The method is implemented on the modified IEEE 30-bus system. The proposed method is compared with those in the previously published literature, and the results confirm that the proposed risk index is better at estimating the voltage instability risk of the system, especially in cases with severe impact and low probability. In addition, according to the simulation results compared to typical security-based planning, the proposed risk-based planning may increase the security and economy of the system due to better utilization of system resources.

شاخص‌های تعامل:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

بازدید 203

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesدانلود 43 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesاستناد 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesمرجع 0
مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources
اطلاعات دوره: 
  • سال: 

    2016
  • دوره: 

    5
  • شماره: 

    1
  • صفحات: 

    1-10
تعامل: 
  • استنادات: 

    0
  • بازدید: 

    251
  • دانلود: 

    0
چکیده: 

Please click on PDF to view the abstract.

شاخص‌های تعامل:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

بازدید 251

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesدانلود 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesاستناد 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesمرجع 0
نویسندگان: 

Mushatet H. H. | Talebi A. A.

اطلاعات دوره: 
  • سال: 

    2025
  • دوره: 

    13
  • شماره: 

    1
  • صفحات: 

    45-52
تعامل: 
  • استنادات: 

    0
  • بازدید: 

    6
  • دانلود: 

    0
چکیده: 

In this study‎, ‎we generalized the co-prime GRAPH of a finite group called the co-prime POWER order GRAPH of a finite group‎. ‎It is denoted by $\beta_G$‎, ‎and its vertex set is $G$‎, ‎such that two distinct vertices $x$ and $y$ are adjacent if and only if $\operatorname{gcd}(|x|,|y|)=p^n$‎, ‎where $p$ is a prime number‎, ‎and $n \in \mathbb{Z}^{+} \cup\{0\}$‎. ‎We characterized complete GRAPHs and planar GRAPHs on the co-prime POWER order GRAPHs‎, ‎and investigated some properties of GRAPH $\beta_G$ for some groups such as cyclic groups‎, ‎dihedral groups‎, ‎and the generalized quaternion groups‎, ‎and obtained the vertex-connectivity among them‎. ‎Finally‎, ‎we characterized some induced subGRAPHs of co-prime POWER order GRAPH for some finite groups.

شاخص‌های تعامل:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

بازدید 6

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesدانلود 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesاستناد 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesمرجع 0
نویسنده: 

MOMTAHAN EHSAN | KAMELI AMENEH

اطلاعات دوره: 
  • سال: 

    2013
  • دوره: 

    44
تعامل: 
  • بازدید: 

    129
  • دانلود: 

    0
چکیده: 

FOR A COMMUTATIVE RING R WITH IDENTITY, THE ZERO DI-VISOR GRAPH OFR, DENOTED 􀀀 (R), IS THE GRAPH WHOSE VERTICES ARE THE NON-ZERO ZERO-DIVISORS OF R WITH TWO DISTINCT VERTICES JOINED BY AN EDGE WHEN THE PRODUCT OF THE VERTICES IS ZERO. REDMOND GENERALIZED THIS NOTION BY REPLACING ELEMENTS WHOSE PRODUCT IS ZERO WITH ELEMENTS WHOSE PRODUCT LIES IN SOME IDEAL I OF R.IN THIS NOTE WE EXTEND RESULTS OF [2] TO THE RINGS OF FORMAL LAURENT POLYNOMIAL AND SERIES WITH RESPECT TO SOME IDEALS.

شاخص‌های تعامل:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

بازدید 129

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesدانلود 0
اطلاعات دوره: 
  • سال: 

    2017
  • دوره: 

    4
  • شماره: 

    1
  • صفحات: 

    19-32
تعامل: 
  • استنادات: 

    0
  • بازدید: 

    186
  • دانلود: 

    0
چکیده: 

The undirected POWER GRAPH of a nite group G, P(G), is a GRAPH with the group elements of G as vertices and two vertices are adjacent if and only if one of them is a POWER of the other. Let A be an adjacency matrix of P(G). An eigenvalue  of A is a main eigenvalue if the eigenspace "( ) has an eigenvector X such that Xtj 6= 0, where j is the all-one vector. In this paper we want to focus on the POWER GRAPH of the nite cyclic group Zn and nd a condition on n where P(Zn) has exactly one main eigenvalue. Then we calculate the number of main eigenvalues of P(Zn) where n has a unique prime decomposition n = prp2. We also formulate a conjecture on the number of the main eigenvalues of P(Zn) for an arbitrary positive integer n.

شاخص‌های تعامل:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

بازدید 186

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesدانلود 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesاستناد 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesمرجع 0
litScript
telegram sharing button
whatsapp sharing button
linkedin sharing button
twitter sharing button
email sharing button
email sharing button
email sharing button
sharethis sharing button